ω-Stable Theories: Introduction

ثبت نشده
چکیده

1 ω Stable/Totally Transcendental Theories Throughout let T be a complete theory in a countable language L having infinite models. For an L-structure M and A ⊆ M let SM n (A) denote the set of n-types of A. We define a topology (called Stone topology) on SM n (A) by setting basic open sets to be of the form Uφ = {p ∈ SM n (A) : φ ∈ p} where φ is an L(A)-formula. Then SM n (A) is totally disconnected, Hausdorff and compact (the latter follows from the compactness theorem).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decidable Models of ω-Stable Theories

We characterize the ω-stable theories all of whose countable models admit decidable presentations. In particular, we show that for a countable ω-stable T , every countable model of T admits a decidable presentation if and only if all n-types in T are recursive and T has only countably many countable models. We further characterize the decidable models of ω-stable theories with countably many co...

متن کامل

An Old Friend Revisited: Countable Models of ω-Stable Theories

We work in the context of ω-stable theories. We obtain a natural, algebraic equivalent of ENI-NDOP and discuss recent joint proofs with S. Shelah that if such a theory has either ENI-DOP or is ENI-NDOP and is ENI-deep, then the set of models of T with universe ω is Borel complete. In 1983 Shelah, Harrington, and Makkai proved Vaught’s conjecture for ω-stable theories [9]. In that paper they det...

متن کامل

Theory Spectra and Classes of Theories

We analyze the spectra of theories that are ω-stable, theories whose spectra include almost every degree, and theories with uniformly arithmetical n-quantifier fragments. We answer a question from Andrews and Miller [2] by showing that there are ω-stable theories whose spectra are not structure spectra. We show that the spectrum created in Andrews and Knight [1] is not the spectrum of an ω-stab...

متن کامل

The structure of superflat graphs

We prove a structure theorem asserting that each superflat graph is treedecomposable in a very nice way. As a consequence we fully determine the spectrum functions of theories of superflat graphs. 0. Introduction. This paper is in a way a continuation of [10], [3], where the investigation of stability of theories of graphs was initiated. In [10], superflat graphs were introduced. In some sense ...

متن کامل

Generalized Amalgamation in Simple Theories and Characterization of Dependence in Non-elementary Classes

We examine the properties of dependence relations in certain non-elementary classes and first-order simple theories. There are two major parts. The goal of the first part is to identify the properties of dependence relations in certain non-elementary classes that, firstly, characterize the model-theoretic properties of those classes; and secondly, allow to uniquely describe an abstract dependen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009